Isomorphism classes of authentication codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On isomorphism classes of generalized Fibonacci cubes

The generalized Fibonacci cube Qd(f) is the subgraph of the d-cube Qd induced on the set of all strings of length d that do not contain f as a substring. It is proved that if Qd(f) ∼= Qd(f ′) then |f | = |f ′|. The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary string. An example of a family of such strings f , f ′, wh...

متن کامل

On the Isomorphism Classes of Transversals

In this paper, we prove that there does not exist a subgroup H of a finite group G such that the number of isomorphism classes of right transversals of H in G is two.

متن کامل

Authentication Codes

The Prêt à Voter end-to-end verifiable voting system makes use of receipts, retained by voters, to provide individual verifiability that their vote has been recorded as cast. The paper discusses issues around the production and acceptance of receipts, and presents an alternative approach to individual verifiability based on Authentication Codes. These codes are constructed, in the encrypted dom...

متن کامل

Computation of Isomorphism Classes of /»-Groups

p-groups may be classified by splitting the groups up into classes having the same commutator relations (isoclinism classes) and then determining the nonisomorphic groups in each class. This paper reduces the problem of determining the isomorphism classes to that of finding the equivalence classes of a set of matrices under some equivalence relation. A computer is used to find the equivalence c...

متن کامل

On Distances between Isomorphism Classes of Graphs

Various measures of distance between (the isomorphism classes of) two graphs have been proposed. These include measures proposed by Zelinka [6],[7], Baláž, Koča, Kvasńıčka & Sekanina [1] and Johnson [4]. Further, there is the edge rotation distance of Chartrand, Saba & Zou [3] and the edge shift distance of Johnson [5]. It is on the latter two that we build. For terminology and notation not exp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 2004

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700035942